Traceable Visual Cryptography Traceable Visual Cryptography

نویسندگان

  • Ingrid Biehl
  • Susanne Wetzel
چکیده

In this paper we present a new k out of n visual cryptography scheme which does not only meet the requirements of the basic visual cryptography scheme deened by Naor and Shamir 5] but is also traceable. With a k out of n scheme it is not possible to reveal the original secret by stacking less than k transparencies. In general one can assume that it is very unlikely that there are k shareholders who would be willing to misuse their shares in order to reveal the secret in a sabotage act. But nding a coalition of 0 < t < k traitors who stack their shares and publish the result so that other coalitions of shareholders can illegaly reveal the secret is a practical scenario and therefore threatens the security of general threshold secret sharing schemes. In this paper we present the idea of traceable visual cryptography schemes which make it possible to trace the saboteurs only with the knowledge of special markings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes

In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...

متن کامل

مطالعه‌ای بر رمز‌نگاری بصری و ارائه‌ی روش پیشنهادی برای رمزنگاری تصاویر رنگی

Visual cryptography is a method that makes use of the characteristics of human vision and it requires neither the knowledge of cryptography nor the complex calculations. This method was first proposed by Naor and Shamir, its implementation is simple, it has been extended to an secrect sharing (k, n) in which n shares are made from the image and they are distributed among n participants. Moreov...

متن کامل

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

متن کامل

Traceable Signature: Better Efficiency and Beyond

In recent years one of the most active research areas in applied cryptography is the study of techniques for creating a group signature, a cryptographic primitive that can be used to implement anonymous authentication. Some variants of group signature, such as traceable signature, and authentication with variable anonymity in a trusted computing platform, have also been proposed. In this paper ...

متن کامل

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997